Competitive queueing systems with comparative rating dependent arrivals
نویسندگان
چکیده
منابع مشابه
Queueing systems with pre-scheduled random arrivals
We consider a point process i + ξi, where i ∈ Z and the ξi’s are i.i.d. random variables with variance σ. This process, with a suitable rescaling of the distribution of ξi’s, converges to the Poisson process in total variation for large σ. We then study a simple queueing system with our process as arrival process, and we provide a complete analytical description of the system. Although the arri...
متن کاملTwo-Class Priority Queueing System with State-Dependent Arrivals
In this paper, we present a performance analysis of a 2-dimensional preemptive priority queueing system with state-dependent arrivals. Using a Markovian formulation we first compute the steady state distribution for the queue length of both classes. Then, waiting times and busy periods are characterized through (i) first and second moments and (ii) the approximation of their cumulative distribu...
متن کاملQueue dependent additional server queueing problem with batch arrivals
— We consider in this paper the steady state behaviour of a Queueing System with queue length dependent additional server facility wherein arrivais occur in batches of variable size. Whenever the queue length in front of the first server reaches a certain lenght, the system adds another server. Steady state probabilities and expected queue lengths in Single Server System and Additional Server S...
متن کاملQueueing system with pre-scheduled random arrivals
We consider a point process obtained summing to each point i of the set of the integer Z an i.i.d random variable ξi having a variance that can be also much larger than 1. We compare the process obtained with this construction with the standard Poisson process, and we show that in some sense our process tends to converge for large variance of ξ to the Poisson process in total variation. We then...
متن کاملCompetitive Analysis of Constrained Queueing Systems
We consider the classical problem of constrained queueing (or switched networks): There is a set of N queues to which unit sized packets arrive. The queues are interdependent, so that at any time step, only a subset of the queues can be activated. One packet from each activated queue can be transmitted, and leaves the system. The set of feasible subsets that can be activated, denoted S, is down...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Perspectives
سال: 2020
ISSN: 2214-7160
DOI: 10.1016/j.orp.2020.100139